On the Perfect Encryption Assumption
نویسنده
چکیده
This property can be exploited (see [Boy90] or [SG92] for other instances) to flaw the Needham-Schroeder symmetric key authentication protocol [NS78]. This protocol intends to permit Alice to establish a shared secret key Kab with Bob and to obtain mutual conviction of the possession of the key by each other. The key is provided by a trusted server S who shares the secret keys Kas and Kbs with A and B respectively. This protocol can be described as follow: A Å S : A.B.Na S Å A : {Na.B.Kab.{Kab.A}Kbs}Kas A Å B : {Kab.A}Kbs B Å A : {Nb}Kab A Å B : {Nb-1}Kab
منابع مشابه
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
Canetti and Fischlin have recently proposed the security notion universal composability for commitment schemes and provided two examples. This new notion is very strong. It guarantees that security is maintained even when an unbounded number of copies of the scheme are running concurrently, also it guarantees non-malleability and security against adaptive adversaries. Both proposed schemes use ...
متن کاملOptimal lot size of EPQ model considering imperfect and defective products
The economic production quantity (EPQ) is a commonly used inventory model. An assumption in the EPQ model is that all units produced are perfect. Some researchers have studied the effects after relaxing this assumption on the inventory models. The objective of this paper is to determine the economic production quantity with reduced pricing, rework and reject situations in a single-stage system ...
متن کاملA Formal Approach for Automatic Verification of Imperfect Cryptographic Protocols
In simplest form, security protocols comprise messages exchanged between agents to achieve security goals such as confidentiality and integrity of data, or authentication of the identity. Despite that simple fact, designing security protocols has been considered critical task since the protocols should work in the presence of powerful adversary over the network. Analyzing security protocols is ...
متن کاملLecture 2 : Computational Notion of Security
We introduce the notion of computational security, in contrast to the perfect security of last lecture, which was an information-theoretic, rather than computational notion. We review the notions of algorithm running time, assymptotic notation, and polynomial time algorithms. We introduce notions of efficient algorithms, negligible probabilities, and adversarial advantage in attacking a cryptos...
متن کاملAn integrated production-marketing planning model With Cubic production cost function and imperfect production process
The basic assumption in the traditional inventory model is that all outputs are perfect items. However, this assumption is too simplistic in the most real-life situations due to a natural phenomenon in a production process. From this it is deduced that the system produces non-perfects items which can be classified into four groups of perfect, imperfect, reworkable defective and non-reworkable d...
متن کاملMultilinear Maps from Obfuscation
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction. We provide two distinct, but closely related constructions and show that multilinear analogues of the DD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000